Average case complexity of linear multivariate problems I. Theory
نویسندگان
چکیده
منابع مشابه
Average Case Complexity of Linear Multivariate Problems Part Ii: Applications
We apply the theoretical results of Part I to linear multivariate problems LMP equipped with the folded Wiener sheet measure. We are particularly interested in multivariate weighted integration and multivariate function approximation. We prove that any LMP which satisses (A.1) of Part I is tractable and its exponent is at most 2. We show that optimal or nearly optimal sample points can be deriv...
متن کاملA Survey of Average Case Complexity for Linear Multivariate Problems*
We survey recent results on the average case complexity for linear multivariate problems. Our emphasis is on problems defined on spaces of functions of d variables with large d. We present the sharp order of the average case complexity for a number of linear multivariate problems as well as necessary and sufficient conditions for the average case complexity not to be exponential in d. DOI: 10.3...
متن کاملAverage Case Complexity of Linear Multivariate
We study the average case complexity of a linear multivariate problem (LMP) defined on functions of d variables. We consider two classes of information. The first Λ std consists of function values and the second Λ all of all continuous linear functionals. Tractability of LMP means that the average case complexity is O((1/ε) p) with p independent of d. We prove that tractability of an LMP in Λ s...
متن کاملAverage Case Complexity Theory
Informally, Average case Complexity theory considers the average complexity with respect to a probability distribution over the set of inputs, instead of the complexity on the worst case input, as a criterion for the hardness of a problem. With regard to this theory, we explore the notion of a natural distribution. In particular, we consider different bounds on the minentropy of such distributi...
متن کاملAverage-case complexity and decision problems in group theory
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on “generic-case complexity” we show that if a finitely generated group G has word problem solvable in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group, then t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1992
ISSN: 0885-064X
DOI: 10.1016/0885-064x(92)90001-r